Heuristics for a bidding problem
نویسندگان
چکیده
In this paper we study a bidding problem which can be modelled as a set packing problem. A simulated annealing heuristic with three local moves, including an embedded branch-and-bound move, is developed for the problem. We compared the heuristic with the CPLEX 8.0 solver and the current best non-exact method, Casanova, using the standard CATS benchmark and other realistic test sets. Results show that the heuristic outperforms CPLEX and Casanova.
منابع مشابه
A Comprehensive Survey on GenCos’ Optimal Bidding Strategy Problem in Competitive Power Markets
This paper represents a complete survey on Generation Companies’ (GenCos’) optimal bidding strategy problem in restructured power markets. In this regard after an introduction to competitive electricity markets, concept of optimal bidding strategy is presented. Considering large amount of works accomplished in this area a novel classification is implemented in order to categorize the existing d...
متن کاملStrategic Bidding in a Pool-Based Electricity Market under Load Forecast Uncertainty
This paper proposes a method for determining the price bidding strategies of market participants consisting of Generation Companies (GENCOs) and Distribution Companies (DISCOs) in a day-ahead electricity market, while taking into consideration the load forecast uncertainty and demand response programs. The proposed algorithm tries to find a Pareto optimal point for a risk neutral participan...
متن کاملImpact of Participants’ Market Power and Transmission Constraints on GenCos’ Nash Equilibrium Point
Unlike perfect competitive markets, in oligopoly electricity markets due to strategic producers and transmission constraints GenCos may increase their own profit through strategic biddings. This paper investigates the problem of developing optimal bidding strategies of GenCos considering participants’ market power and transmission constraints. The problem is modeled as a bi-level optimizati...
متن کاملEffective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons
Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and pa...
متن کاملPrice-takers’ bidding strategies in joint energy and spinning reserve pay-as-bid markets
Strategic bidding in joint energy and spinning reserve markets is a challenging task from the viewpoint of generation companies (GenCos). In this paper, the interaction between energy and spinning reserve markets is modeled considering a joint probability density function for the prices of these markets. Considering pay-as-bid pricing mechanism, the bidding problem is formulated and solved as a...
متن کاملOptimal Bidding Strategies of GENCOs in Day-Ahead Energy and Spinning Reserve Markets Based on Hybrid GA-Heuristic Optimization Algorithm
In an electricity market, every generation company (GENCO) attempts to maximize profit according to other participants bidding behaviors and power systems operating conditions. The goal of this study is to examine the optimal bidding strategy problem for GENCOs in energy and spinning reserve markets based on a hybrid GA-heuristic optimization algorithm. The heuristic optimization algorithm used...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & OR
دوره 33 شماره
صفحات -
تاریخ انتشار 2006